Automatic Verification with Abstraction and Theorem Proving
نویسندگان
چکیده
ion engine. In the cases when it applies, the method can exclude infinitely many paths at once. Moreover, the method also applies when programs are under-approximated or over-approximated, and can be used to deliver final correct results thanks to the flexibility of the predicate abstraction approach. These techniques have been implemented in the tool Eldarica, which is publicly available and has shown promising results in this remarkably difficult and important domain of algorithmic software verification. What is particularly remarkable that these techniques are general enough to apply to a wide range of domains, from hardware descriptions, to C and Scala programs, to concurrent timed systems. Lausanne, June 2013 Viktor Kuncak
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملAn Update on STeP: Deductive-Algorithmic Verification of Reactive Systems
The Stanford Temporal Prover, STeP, is a tool for the computer-aided formal verification of reactive systems, including real-time and hybrid systems, based on their temporal specification. STeP integrates methods for deductive and algorithmic verification, including model checking, theorem proving, automatic invariant generation, abstraction and modular reasoning. We describe the most recent ve...
متن کاملUsing Theorem Proving with Algorithmic Techniques for Large-Scale System Verification∗
We propose to write a thesis on using theorem proving with algorithmic techniques for verification of large scale computer systems. Large-scale computer systems tend to have a non-terminating computation, and reasoning about such systems involves exhibiting some temporal property of the system. For large system models, automatic verification of non-trivial temporal properties is often infeasibl...
متن کاملCombination of Isabelle/HOL with Automatic Tools
We describe results and status of a sub project of the Verisoft [1] project. While the Verisoft project aims at verification of a complete computer system starting with hardware and up to user applications, the goal of our sub project is an efficient hardware verification. We use the Isabelle theorem prover [2] as the major tool for hardware design and verification. Since many hardware verifica...
متن کاملZapato: Automatic Theorem Proving for Predicate Abstraction Refinement
Counterexample-driven abstraction refinement is an automatic process that produces abstract models of finite and infinite-state systems. When this process is applied to software, an automatic theorem prover for quantifier-free first-order logic helps to determine the feasibility of program paths and to refine the abstraction. In this paper we report on a fast, lightweight, and automatic theorem...
متن کامل